Asymptotic Analysis and Random Sampling of Digitally Convex Polyominoes

نویسندگان

  • Olivier Bodini
  • Philippe Duchon
  • Alice Jacquot
  • Ljuben R. Mutafchiev
چکیده

Recent work of Brlek et al. gives a characterization of digitally convex polyominoes using combinatorics on words. From this work, we derive a combinatorial symbolic description of digitally convex polyominoes and use it to analyze their limit properties and build a uniform sampler. Experimentally, our sampler shows a limit shape for large digitally convex polyominoes. Introduction In discrete geometry, a finite set of unit square cells is said to be a digitally convex polyomino if it is exactly the set of unit cells included in a convex region of the plane. We only consider digitally convex polyominoes up to translation. The perimeter of a digitally convex polyomino is that of the smallest rectangular box that contains it. The notion of digitally convex polyominoes arises naturally in the context of curvature estimators and consequently in the important field of pattern recognition [18, 10]. Brlek et al. [9] described a characterization of digitally convex polyominoes, in terms of words coding their contour. In this paper, we reformulate this characterization in the context of constructible combinatorial classes and we use it to build and analyze an algorithm to randomly sample digitally convex polyominoes. LIPN, Université Paris 13, 99, avenue Jean-Baptiste Clément 93430 Villetaneuse, France LaBRI, 351, cours de la Libération F-33405 Talence cedex, France LIPN, Université Paris 13, 99, avenue Jean-Baptiste Clément 93430 Villetaneuse, France Institute of Mathematics and Informatics Acad. Georgi Bonchev Str., Block 8 1113 Sofia, BULGARIA The usual definition of a polyomino requires the set to be connected, whereas digitally convex sets may be disconnected. However, one can coherently define some polygon as the boundary of any digitally convex polyomino; in the case of disconnected sets, this boundary will not be self-avoiding. 1 ha l-0 08 32 01 6, v er si on 1 9 Ju n 20 13 Author manuscript, published in "Discrete Applied Mathematics (2013) 1-23"

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Counting k-Convex Polyominoes

We compute an asymptotic estimate of a lower bound of the number of k-convex polyominoes of semiperimeter p. This approximation can be written as μ(k)p4p where μ(k) is a rational fraction of k which up to μ(k) is the asymptotics of convex polyominoes. A polyomino is a connected set of unit square cells drawn in the plane Z × Z [7]. The size of a polyomino is the number of its cells. A central p...

متن کامل

Two generalizations of column-convex polygons

Column-convex polygons were first counted by area several decades ago, and the result was found to be a simple, rational, generating function. In this work we generalize that result. Let a p-column polyomino be a polyomino whose columns can have 1, 2, . . . , p connected components. Then columnconvex polygons are equivalent to 1-convex polyominoes. The area generating function of even the simpl...

متن کامل

Random generation of Q-convex sets

The problem of randomly generating Q-convex sets is considered. We present two generators. The first one uses the Q-convex hull of a set of random points in order to generate a Q-convex set included in the square [0, n)2. This generator is very simple, but is not uniform and its performance is quadratic in n. The second one exploits a coding of the salient points, which generalizes the coding o...

متن کامل

On the Generation and Enumeration of some Classes of Convex Polyominoes

ECO is a method for the recursive generation, and thereby also the enumeration of classes of combinatorial objects. It has already found successful application in recent literature both to the exhaustive generation and to the uniform random generation of various objects classified according to several parameters of interest, as well as to their enumeration. In this paper we extend this approach...

متن کامل

Convex Domino Towers

We study convex domino towers using a classic dissection technique on polyominoes to find the generating function and an asymptotic approximation.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013